The 2-valued case of makespan minimization with assignment constraints
نویسندگان
چکیده
We consider the following special case of minimizing makespan. A set of jobs J and a set of machines M are given. Each job j ∈ J can be scheduled on a machine from a subset Mj of M . The processing time of j is the same on all machines in Mj . The jobs are of two sizes, namely b (big) and s (small). We present a polynomial-time algorithm that approximates the value of the optimal makespan within a factor of 1.883 and some further improvements when every job can be scheduled on at most two machines.
منابع مشابه
SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT
In this paper, a due date assignment scheduling problem with precedence constraints and controllable processing times in uncertain environment is investigated, in which the basic processing time of each job is assumed to be the symmetric trapezoidal fuzzy number, and the linear resource consumption function is used.The objective is to minimize the crisp possibilistic mean (or expected) value of...
متن کاملOn (1, ∊)-Restricted Assignment Makespan Minimization
Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time (2− δ)-approximation algorithm is known for the problem for constant δ > 0. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be assigned to one from a specified subset. Recently in a br...
متن کاملParallel machine scheduling with nested job assignment restrictions
We derive a polynomial time approximation scheme for a special case of makespan minimization on unrelated machines. © 2009 Elsevier B.V. All rights reserved.
متن کاملOn $(1,\epsilon)$-Restricted Assignment Makespan Minimization
Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time (2 − δ)-approximation algorithm is known for the problem for constant δ > 0. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be assigned to one from a specified subset. Recently in a b...
متن کاملRandomized Load Balancing with Non-Uniform Task Lengths
In this paper we consider the classical multiprocessor scheduling problem. In this problem, the goal is to assign a collection of tasks with different execution times to a set of machines so that the total load is balanced as evenly as possible across the machines. This objective is typically expressed as minimization of the makespan, or the load on the most heavily loaded machine. In general, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 113 شماره
صفحات -
تاریخ انتشار 2013